Information management, retrieval and display systems and associated methods

ABSTRACT

An information management, retrieval and display system searches through an informational resource, such as a document (e.g., a treaty), a number of individual documents (e.g., Web pages resident on the Internet), or a stream of information (e.g., DNA code, source code, satellite data transmissions, etc.) and displays the results of the search in an collapsible/expandable format based upon a user-selected display criteria or hierarchy. Such a display hierarchy will allow the end-user to effectively and quickly obtain items of interest from the search results. Generally, the system performs a method for retrieving information from an informational resource that includes the steps of: (a) dividing the informational resource into a plurality of finite elements; (b) assigning a categorical tag to each of the plurality of finite elements, where the categorical tag includes data pertaining to a content of the finite element; (c) generating a searchable database record for each of the plurality of finite elements, where each searchable database record includes at least one string contained within the finite element, where the string can be a word, a phrase, a symbol, a group of symbols, a data segment or the like; (d) supplying a search string; (e) searching the searchable database for searchable database records containing the search string; (f) arranging the results of the searching step in a hierarchal structure according, at least in part, to the data in the categorical tags assigned to the finite elements found in the searching step; and (g) displaying the results of the searching step in the hierarchal structure.

BACKGROUND

The present invention is a computerized system and method for searchingthrough and retrieving information from an informational resource; andmore particularly, the present invention is an information management,retrieval and display system for searching through an informationalresource and for displaying the results of the search in ancollapsible/expandable format based upon a user-selected displaycriteria or hierarchy.

An inherent drawback in many conventional search engines or searchtools, such as Infoseek™, AltaVista™, Hotbot™, is that the results ofthe search are typically organized according to the number of hits thatthe search word or phrase made in each document (Web page) beingsearched. This type of search result display requires the end user to gothrough the hits one by one in order to finally access the documenthe/she was looking for. Another drawback with such conventional searchengines is that the results of the search do not take into account thata word may have several different meanings, and may be used in manydifferent contexts. For example, if an end user were looking forinformation on a cartoon mouse, because the search query would containthe word “mouse,” the list of hits will include documents for theelectronic cursor-control devices, documents providing biologicalinformation on mice, documents providing pet information on mice, etc.Therefore, the end user may have to go through an enormous number ofthese hits before finally (if ever) reaching a hit related to thecartoon mouse.

Thus, there is a need for a search engine or search tool that allows theend user to that arranges the search results in a manner that allows theend user to effectively and quickly obtain items of interest.

SUMMARY

The present invention is an information management, retrieval anddisplay system for searching through an informational resource, such asa document (e.g., a treaty), a number of individual documents (e.g., Webpages resident on the Internet), or a stream of information (e.g., DNAcode, source code, satellite data transmissions, etc.) and fordisplaying the results of the search in an collapsible/expandable formatbased upon a user-selected display criteria or hierarchy. Such a displayhierarchy will allow the end-user to effectively and quickly obtainitems of interest from the search results. The type or format of theinformational resource is not critical.

The invention includes four primary modules, a break module, an indexingmodule, a search module and an un-break module. The break module is anexpert system operating upon a set of expert rules that define itsoperation. The break module parses through the informational resource tobreak up the informational resource into finite elements (such asparagraphs, sections, sub-sections, segments etc.). The break modulealso creates categorical tags for each of these finite elements, wherethe categorical tags assigned to each of the finite elements are basedupon and analysis (defined by the set of expert system rules) of thecontents of each of the finite elements. The categorical tag can includea standard classification such as, for example, “Dewey Decimal-type”number. The categorical tag can also include an organizational attribute(such as pertaining to the type or location of the finite element withrespect to the rest of the rest of the informational resource), adate-stamp, a categorical word, etc. Preferably, the categorical tagsare inserted into the finite element.

The index module parses through the finite elementsidentified/created/processed by the break module and creates asearchable database having a database record for each of the finiteelements identified by the break module. The searchable database is atype of reverse index, where each record includes an address or locationof the corresponding finite element (and, in turn, the categorical tagincluded therewith), and strings (such as words, phrases, etc.)contained in the finite element and their frequency (i.e., their weight)within the finite element.

In applications where the users of the invention do not have control ofthe information being searched (i.e., Web pages on the Internet), eachdatabase record may also include the categorical tag, since thecategorical tag will not be able to be inserted by the break module intothe finite elements themselves. Furthermore, with the Web searchapplication, it may not be necessary to utilize the break and un-breakmodules at all since each Web-page or link might be considered afinite-element for the purposes of the present invention.

Once the reverse index is created, a search of the reverse index may beperformed. Key strings (such as key words, phrases or symbol segments)may be supplied by an end user as a search query, and a displayhierarchy or criteria may also be selected or defined by the user. Theselected display criteria will instruct the search module how tomanipulate the data of the search results. Specifically, the selecteddisplay criteria will define if the search results are to be displayedin an order or structure based entirely upon the information containedwithin the categorical tags (research-centric), if the search resultsare to be displayed in an order depending entirely upon the frequency ofthe key strings present in the finite elements (conventional), or if thesearch results are to be displayed in an order or structure based upon acombination of the two (document-centric).

The search module accesses the search query and searches through thereverse index for database records matching the specific search term orquery. The search results are then displayed in ancollapsible/expandable (tree) structure by applying the information inthe categorical tags for each of the finite elements satisfying thesearch criteria to the selected display hierarchy. For example, if theselected hierarchy is a document-centric hierarchy, a first level of thedisplay hierarchy may be, for example, the year in which the finiteelement was created; a second level of the display hierarchy may be, forexample, the order in which the finite elements appear in the document;and a third level of the display hierarchy may be, for example, basedupon the frequency in which the search words appear in each of thefinite elements. The operation of the search module, as with the breakand index modules, is based upon a set of expert rules. Therefore, ifthe search results are not satisfactory, the expert rules in the break,index and/or search modules are modified and the procedure is performedagain.

Once one of the finite elements in the search result display areselected by the end-user, the un-break module allows the end user toview a contiguous portion of the informational resource that theselected finite element belongs to. The un-break module will assembleselected finite element with other related finite element to reconstructthe contiguous portion of the informational resource. The un-breakmodule refers to the categorical tag of the selected finite element forinformation related to the location of the finite element with respectto the entire informational resource, and will then build a portion ofthe informational resource from all of the finite elements belong tothat portion. For example, if the selected finite element is a paragraphof a document, the un-break module may be configured to rebuild thechapter of the document to which the paragraph belongs. As with theother modules of the present invention, the operation of the un-breakmodule is controlled by a set of expert rules that may be modified ifthe results are unsatisfactory.

It is envisioned that the rule sets will be created and refined by anexpert on the document or information being searched. For example, ifthe system of the present invention is to be associated with Volume 37of the Code of Federal Regulations, an individual (or group ofindividuals) with intimate knowledge of the Volume would be best suitedto generate and fine-tune the rule sets. The fine-tuning of the rulesets would involve the individual continuously performing examplesearches on the Volume using the rule sets, and continuously modifyingthe rule sets to obtain the search results with the desired content andformat. Once the rule sets have been fine-tuned, the search module ofthe present invention can be packaged along with the Volume and sold ordistributed as a searchable Volume. Likewise, the search module couldoperate on a Web-site so that users can access the Web-site and performsearches on the Volume. Since the rule sets have already been definedand fine-tuned by the “experts,” the users would have a fully operablesearch engine that performs searches and displays results in accordancewith an expert's intimate knowledge with the Volume.

As mentioned above, it is also envisioned that an embodiment of theinvention is designed to search through a number of individual Web pagesresident on the Internet and to display the results of the search in ancollapsible/expandable format based upon a user-selected displaycriteria or hierarchy. In such an embodiment, a break module in the formdescribed above may not be necessary because each Web page may alreadybe considered to be a “finite element” and the search engine will not beable to modify the Web pages. Accordingly, in such an application, theindex module will parse through each of the Web pages (finite elements)to create a searchable database having a record for each of the Webpages. Each record in the searchable database will include the Webaddress of the Web page, non-common words contained in the Web pagealong with their frequency (weight), and a categorical tag, as describedabove, which includes data based upon an analysis of the contents of theWeb page. The index module will also review each of the Web pages todetermine if the creator of the Web page had embedded a categorical taginto the Web page itself; and if such an embedded categorical tag isfound, the index module may simply insert this pre-defined categoricaltag into the database record rather than creating one itself. Therefore,as the present invention becomes more prevalently used on the Internet,Web page creators may desire to create their own categorical tags fortheir Web pages rather than having the search engine create one forthem. With this feature, the Web page designer may be able to influencethe search results, perhaps to achieve a more accurate depiction of theWeb site. Of course, such a feature may also be used by the Webdesigners in a deceptive manner, where the categorical tag will causethe Web page to be listed in search results when the searcher is lookingfor an entirely different type of information. Recognizing thispotential problem, the index module will include an option where it willcompare the actual contents of the Web page against the embeddedcategorical tags, and will create a new categorical tag to be insertedinto the database record if there is a significant difference. Likewise,the index module can be configured to filter out Web sites havingundesirable or unsavory content as indicated by the embedded categoricaltags or as determined by a review of the content of the Web page itself.

In another embodiment of the invention, the dynamic expert rule sets maybe configured to accept and index all manner of static and dynamicinformation (such as news-feeds, data transmissions, etc.) on a globalscale where an end-user will be able to efficiently and quickly obtainany sort of information he/she wishes from a hierarchal search resultdisplay based upon a categorical organization scheme such as theDewey-Decimal system.

Thus, in one aspect of the present invention, a method for retrievinginformation from an informational resource comprises the steps of: (a)dividing the informational resource into a plurality of finite elements;(b) assigning a categorical tag to each of the plurality of finiteelements, where the categorical tag includes data pertaining to acontent of the finite element; (c) generating a searchable databaserecord for each of the plurality of finite elements, where eachsearchable database record includes at least one string contained withinthe finite element, where the string can be a word, a phrase, a symbol,a group of symbols, a data segment or the like; (d supplying a searchstring; (e) searching the searchable database for searchable databaserecords containing the search string; (f) arranging the results of thesearching step in a hierarchal structure according, at least in part, tothe data in the categorical tags assigned to the finite elements foundin the searching step; and (g) displaying the results of the searchingstep in the hierarchal structure.

The informational resource may be a single document, a plurality ofdocuments or a stream of data, and the step of identifying the finiteelements may include the steps of identifying sections or sub-sectionswithin the document(s) or data stream or by simply identifying thedocuments themselves. The step of dividing the informational resourceinto a plurality of finite elements is preferably performed by an expertsystem according to a rule set; and the step of assigning a categoricaltag to each of the plurality of finite elements is also preferablyperformed by an expert system according to another rule set. Ifunsatisfactory results are obtained in step (g) above, one or both ofthe rule sets may be modified by the end user and the steps (a) through(g) may be performed again.

Each database record preferably includes an address or pointer to thecorresponding finite element and further preferably includes all of thenon-common strings (e.g., words or phrases) contained within thecorresponding finite element along with the frequency that such stringsappear.

In another aspect of the present invention, a method for retrievinginformation from an informational resource includes the steps of:defining a first rule set for dividing the informational resource into aplurality of finite elements; utilizing the first rule set, dividing theinformational resource into a plurality of finite elements; defining asecond rule set for creating a categorical tag for one of the pluralityof finite elements; utilizing the second rule set to create acategorical tag for each of the plurality of finite elements; generatinga searchable database including a searchable database record for each ofthe finite elements; searching the searchable database for relevantdatabase records; associating the relevant database records found in thesearch with corresponding relevant finite elements; selecting ahierarchy for displaying identifying phrases pertaining to the relevantfinite elements; ordering the relevant finite elements in the hierarchyaccording, at least in part, to the categorical tag for each of thefinite elements; and displaying the identifying phrases pertaining tothe relevant finite elements according to the results of the orderingstep.

In another aspect of the present invention, a data storage device (suchas a CD ROM) is provided, which comprises: an informational resourcedivided into a plurality of finite elements, where each of the finiteelements includes a categorical tag and a database record assignedthereto, where the categorical tag includes data pertaining to a contentof the finite element and the database record includes at least onestring contained within the finite element; and also comprises softwareinstructions programmed to retrieve and display at least a portion ofthe informational resource. The software instructions are configured toperform the steps of: supplying a search string, searching through thedatabase records for relevant database records containing the searchstring, arranging the results of the searching step in a hierarchalstructure according to the information in the categorical tags assignedto the finite elements corresponding to the relevant database records,and displaying identifying phrases for the finite elements correspondingto the relevant database records in the hierarchal structure.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic flow-diagram representation of the operation of afirst embodiment of the present invention;

FIGS. 2A and 2B are flow-chart representations of the operation of theembodiment illustrated in FIG. 1;

FIG. 3 is a flow-chart representation of an operation of a secondembodiment of the invention, resident on a data storage device such as aCD ROM;

FIG. 4 is a schematic flow-diagram representation of the operation of athird embodiment of the present invention; and

FIGS. 5A and 5B are flow-chart representations of the operation of theembodiment illustrated in FIG. 4.

DETAILED DESCRIPTION

The present invention is an information management, retrieval anddisplay system for searching through an informational resource, such asa document (e.g., a treaty), a number of individual documents (e.g., Webpages resident on the Internet), or a stream of information (e.g., DNAcode, source code, satellite data transmissions, etc.) and fordisplaying the results of the search in an collapsible/expandable formatbased upon a user-selected display criteria or hierarchy. Such a displayhierarchy will allow the end-user to effectively and quickly obtainitems of interest from the search results.

As shown in FIG. 1, in a first embodiment of the invention, theinformation management, retrieval and display system includes fourprimary modules, a break module 10, an indexing module 12, a searchmodule 14 and an un-break module 16. Each of these processing modulesare preferably expert engines operating upon a set of expert rules thatdefine the operation of the individual module. As will be described infurther detail below, the expert rules for these modules are preferablygenerated by a person or persons having intimate knowledge of thedocument or documents 18 being searched; and the fine tuning of theexpert rules is a iterative process where the expert will modify orchange the rules of one or more of the above modules if a search throughthe document or documents proves to be unsatisfactory.

The break module 10 parses through an informational resource, such as agroup of documents 18 to break up the group of documents into “finiteelements” 20a-20z. Each finite element is a user-defined “basket” ofinformation from documents that is to be individually indexed andsearched. The finite element is usually not a single word, phrase orsymbol, but is a section or portion of an informational resource thatcan be identified and isolated by the break module. A simple example ofa finite element would be the individual paragraphs of a document. Otherexamples of finite elements would include sub-chapters of a document,individual pages of a document, and other types of identifiable sectionsof a document. In some instances, the finite element can be the entiredocument itself. The break module is also responsible for analyzing thecontents of each finite element 20a-20 z and creating a categorical tag22a-22z for each finite element, which is to be inserted into the finiteelement. The categorical tags 22a-22z may include a standardclassification based upon the content analysis such as, for example, a“Dewey Decimal” type number, or some other categorical reference number.The categorical tag may also include an organizational attribute such aspertaining to the type of finite element or the location of the finiteelement within the document, a date stamp, a categorical word or phrasesummarizing the contents of the finite element, etc. As will bediscussed in detail below, the contents of each categorical tag providesinformation to the search module 12 so as to assist the search module increating the hierarchical display of the search results.

The index module parses through each of the finite elements created bythe break module and creates a searchable database 23 including adatabase record 24a-24z for each of the finite elements created by thebreak module. The searchable database 23 is a type of reverse index,where each record 24a-24z includes an address or location of thecorresponding finite element and all words contained within the finiteelement (preferably excluding common words such as “and,” “in,” “the,” .. . ) along with their frequency of appearance within the finite element(i.e., their weight).

At some point during the process, a user, which may be an end user ormay be the expert developing the rule sets, will enter a search query 26and an optional hierarchical selection 28. The search query may be anyconventional search query as available to those of ordinary skill in theart and may include search words or phrases and/or operators tying thewords together. The hierarchy selection informs the search module thetype of display format that the user wishes to see the results displayedwithin. Specifically, the hierarchy selection will inform the searchmodule whether or not the search results are to be displayed in an orderor structure based entirely upon the information contained within thecategorical tags (research-centric), if the search results are to bedisplayed in an order depending entirely upon the frequency of the keywords or phrases present within the finite elements (conventional), orif the search results are to be displayed in an order or structure basedupon a combination of the two (document-centric).

The search module will utilize the search query to search through thedatabase records 24a-24z so as to find the database records 30 matchingthe words or phrases in the search query. The search module will then,depending upon the selected hierarchy 28, display the search results 32in an order or collapsible/expandable tree structure based uponinformation from the categorical tags 22 included in the finite elements20 that are associated with the records 30 matching the search query.For example, a first level of the display hierarchy might be orderedaccording to the chapters of a document that the finite elements arecontained within. Information regarding the chapters that the finiteelements are contained within will be resident within the categoricaltags associated with the finite elements. A second level of the displayresults may order the finite elements for each chapter based upon theweight or frequency that the search words or phrases appear within eachfinite element. Therefore, on the search results screen the end userwill select which chapter he or she would like to view a relevant finiteelement from and the display will then expand to show the finiteelements from that chapter matching the search query. These finiteelements contained within this chapter will be ordered depending uponthe weight of the search query or words. From there, the user will makea selection 34 indicating to the un-break module 16 which of the finiteelements the user wishes to view.

It will be appreciated by those of ordinary skill in the art that thedifferent combinations of ordering schemes and tiers for any givenhierarchy is virtually limitless. Other examples of ordering schemes andtiers can be based upon the topic of the finite element, the author orprovider of the finite element, the time/date of the finite element, theposition of the finite element with respect to the information resource,etc. It is also within the scope of the invention that the hierarchyonly include one tier or level of ordering.

While it is preferred that the search module displays the search resultsin an collapsible/expandible tree structure, it is also within the scopeof the invention that the display results be displayed in alternatehierarchal or tiered structures. An example of an alternatehierarchal/tiered structure is the use of a cascaded or tiled display topresent the various levels of the hierarchy. Of course, if there is onlyone tier or level of ordering, the display structure would not need tobe collapsible/expandible.

The search module may also be configured to recognize that a string inthe search query may have other permeations, which may be used by thesearch engine to provide matches with the database records. For example,if the search query includes a word in a first language, it is withinthe scope of the invention for the search module to provide the word inother languages when looking for matches with the database records.Likewise, it is within the scope of the invention for the search moduleto provide other known forms or tenses of the word; and it is alsowithin the scope of the invention for the search module to provide othersearch words having a similar or the same meaning.

The un-break module 16 accesses the categorical tag of the selectedfinite element 34 to determine the other finite elements 36 of thedocuments 18 that are to be grouped together so as to form the singlecontiguous display 38. For example, if the selected finite element 34 isa paragraph of the document, the un-break module 16 will refer to thecategorical tags of the remaining finite elements to determine the otherfinite elements 36 that appear on the same page as the selected finiteelement so as to display the entire page 38 rather than the singleparagraph. Likewise, the un-break module can group related finiteelements together in a contiguous chapter, section, or other contiguousidentifiable portion of the document or documents. Simply put, theun-break module is used for displaying the selected finite element incontext with the remaining portions of the informational resource.

While it is preferred that the un-break module is utilized toreconstruct contiguous portions of the informational resource, it iswithin the scope of the invention to configure the expert rule sets ofthe un-break module to construct new informational resources using theselected finite elements and other finite elements from the originalinformational resource. For example, the un-break module may beconfigured to compile all of the finite elements matching the searchquery into a new informational resource, using the categorical tags forthese finite elements to dictate the order in which the finite elementswill be compiled. In another example, the un-break module may beconfigured to review the categorical tag of the selected finite elementto determine other finite elements that are related to the selectedfinite element based on the date that the finite elements were created,or the author/owner of the finite element, or the content of the finiteelement; and the un-break module will then construct a new informationalresource compiling all of the related finite elements.

FIGS. 2A and 2B provide a flowchart representation of an operation ofthe information management, retrieval and display system for theembodiment described above. As shown in functional block 40, a firststep is to access the informational resource being examined. Asillustrated in functional block 42, the next step is to select theappropriate expert rule sets to apply for searching through theinformational resource. The particular rule set selected will dependupon the type of information resource that was accessed in step 40. Forexample, a set of expert rule sets used for searching through andanalyzing the Antarctic Treaty will be different than a set of rule setsused for analyzing and searching through volume 37 of the Code ofFederal Regulations. As shown in functional block 44, the next step isto break the information resource into a plurality of finite elementsaccording to a first set of the expert systems rules. As discussedabove, this step involves breaking the informational resource intoidentifiable segments of information such as paragraphs, subsections,pages, chapters, subchapters and the like. An example rule set forbreaking the Antarctic Treaty into a plurality of finite elements isprovided below in Table 1.

TABLE 1 FINISHED EXAMPLE OF A ‘RULE SET’ FOR AUTOMATICALLY DIVIDINGDOCUMENTS INTO SEGMENTS OR ELEMENTS¹ DOCUMENT SPECIFIC DIVISION DOCUMENTPATTERN LEVELS DIVISIONS MATCHING RULES Primary Level Antarctic Treaty,Recognize by bolded large Conventions, Protocol fonts centered on pageand its Annexes Secondary Level Recommendations, Recognize by RomanMeasures, etc. numerals Tertiary Level Articles within Recognize bymedium fonts documents from the centered on page with a primary orsecondary colon levels Grouped Level Antarctic Treaty Group documents bytheir Consultative Meeting Roman numerals Appended Level Year Append thesignature date for documents at the primary, secondary or grouped levels¹Based on the public-domain documents in the Antarctic Treaty Handbookwhich has been published since the 1960's by the United StatesDepartment of State in hardcopy form only and which now has beenconverted into a searchable database. ²Source codes are described usingJAVA but could easily be written in PERL or any other programminglanguage. See Appendix A for example source code segments

As shown in the above table, the example rule set is adapted to dividethe Antarctic Treaty into a plurality of levels where a primary level ofthe Treaty, which involves the Antarctic Treaty, Conventions, Protocoland its Annexes, is recognized by the search engine by identifying bold,large font centered on a page. A secondary level, which are theRecommendations and Measures contained within the Treaty, are recognizedby the search engine by identifying Roman numerals. A tertiary level isutilized to divide up the primary and secondary levels into smallerfinite elements. This tertiary level of finite elements is recognized bythe search engine by identifying medium fonts centered on a page with acolon. The remaining levels of the table should be apparent to those ofordinary skill in the art upon analyzing the table and the associatedpattern matching rules.

Accordingly, the purpose of the above rule set is to create an automatictool for matching patterns that distinguish hierarchies, segments orelements within any type of informational resource. The rule set isdeveloped in relation to user-defined requirements for the segments orelements that need to be indexed and searched within the informationalresource. It will also be apparent to those of ordinary skill in the artthat the rule sets will be greatly simplified in informational resourcesthat include already distinguished segments or elements, such as inseparate columns or blocks. Preferably, the rule sets are designed by anexpert having intimate knowledge of the informational resource, in aniterative manner utilizing feed-back loops as will be described below.

As shown in functional block 46, a next step is to create a categoricaltag for each of the finite elements based upon a positional and/orcontent analysis of the finite element according to a second set ofexpert system rules. An example of a rule set for defining categoricaltags for finite elements extracted from the Antarctic Treaty is providedbelow in Table 2.

TABLE 2 EXAMPLE OF CATEGORICAL TAGS THAT WERE AUTOMATICALLY ATTACHED TOFINITE ELEMENTS CREATED WITH THE USER-DEFINED ‘RULE SETS’ (SEE TABLE 1)¹DOCUMENT DIVISION LEVELS SPECIFIC DOCUMENT DIVISIONS Primary LevelAntarctic Treaty, Conventions, Protocol and its Annexes Secondary LevelRecommendations, Measures, etc. Tertiary Level Articles within documentsfrom the primary or secondary levels Grouped Level Antarctic TreatyConsultative Meeting Appended Level Year ¹Based on the public-domaindocuments in the Antarctic Treaty Handbook which has been publishedsince the 1960's by the United States Department of State in hardcopyform only and which now has been converted into a searchable database.²Source codes are described using JAVA but could easily be written inPERL or any other programming language. See Appendix A for examplesource code segments.

As shown in Table 2, the categorical tag will include notationindicating the finite element's position within each of the variousidentified levels of the Antarctic Treaty. For example, the categoricaltag will include information indicating if on a primary level, thefinite element is contained within the Antarctic Treaty, theConventions, the Protocol or its Annexes. On a secondary level, thecategorical tag will indicate whether or not the finite element isincluded in the Recommendations, Measures, etc. As shown in the bottomof the table, the categorical tag for each of the finite elements willalso include a content base notation indicating the year that theparticular section or finite element was created. Of course, the typeand variations of positional and/or content base notations included inthe categorical tags are virtually limitless. For example, the rule setmay be configured to analyze the contents of the finite element so as toprovide a categorical word or phrase which provides a clue to the useras to the contents of the finite element. Similarly, rather thanutilizing a word or phrase, the rule set can analyze the contents orposition of the finite element to provide a categorical reference numberto the finite element, such as a Dewey Decimal type number.

As shown in functional step 48, a next step is to insert the categoricaltag created above in step 46 into the finite element created in step 44.As shown in functional block 50, a next step is to generate, for each ofthe finite elements, a searchable database record. Each database recordpreferably contains the noncommon strings (e.g., words, phrases,symbols) contained within the finite element along with their frequency(i.e., weight). Furthermore, each database record will include anaddress, location or link to the corresponding finite element. As shownin functional. block 52, a next step is to enter a search string such asa word, phrase or symbol(s) and to select a display hierarchy. As shownin functional block 54, a next step is to search through the databaserecords created in functional block 50 for matches between the searchstring and the noncommon strings of the database records. This searchingstep will identify the relevant database records having noncommonstrings matching the search string. As shown in functional block 56, therelevant database records found in the searching step 54 will be orderedby applying information from each of the categorical tags of therelevant database record's associated finite element to the selecteddisplay hierarchy and/or by applying the weight of the matching searchstrings in the relevant database records to the selected displayhierarchy.

For example, a first level of the display hierarchy for the AntarcticTreaty might be the year that the finite element was created; the secondlevel might be ordered according to the order of the Articles of theAntarctic Treaty; and a third level of the display hierarchy might beordered according to the weight of the matching strings contained withinthe database records.

As shown in functional block 58, a next step would be to display thesearch results in the collapsible/expandable hierarchy on a displayscreen. As shown in functional block 60, the user will determine whetherthe search results were satisfactory, and if not the process willadvance to functional block 62 where the user will modify one or more ofthe rule sets and will return either to functional block 44 or tofunctional block 52 depending upon which rule sets have been modified.

If, in functional block 60, the search results are satisfactory, theprocess will advance to functional block 64 where the user will selectone of the finite elements from the search results display. Then infunctional block 66, the categorical tag of the selected finite elementwill be used to identify other finite elements that are to be groupedtogether with the selected finite element to create a contiguous portionof the informational research to be displayed. Finally, in functionalblock 68, the contiguous portion of the informational resource will bedisplayed on the display screen or printed.

It is envisioned that an expert having intimate knowledge of theinformational resource will develop the rule sets based upon his or herknowledge of the informational resource. Thereafter, once the rule setshave been fully developed, the feed-back portion of the above-describedflow chart will no longer be necessary.

Furthermore, once the rule sets have been fully developed, the searchmodule, the un-break module and the fully developed rule sets may beincorporated onto a data storage device (such as a CD ROM, a disk-drive,a floppy-disk and the like) along with an informational resourcepre-broken into its plurality of finite elements, where each of thefinite elements includes the corresponding categorical tag previouslycreated therefore, along with the pre-created searchable database forthe plurality of finite elements. Therefore, such a storage device wouldessentially provide a searchable document that includes the entirecontent of the informational resource along with a search engine thathas been fined tuned by an expert with intimate knowledge of theinformational resource, so that end users of the CD ROM (or other typeof storage device) would be able to take advantage of the expert'sknowledge and experience in searching through the informational resourcecontained therewith.

As shown on FIG. 3, a flow chart representation of an embodiment of theinvention resident on a data storage device, such as a CD ROM, ispresented. Essentially, this embodiment is equivalent to the embodimentdescribed in FIGS. 2A and 2B above, except that the development of therule sets are not longer required. As shown in functional block 52′, afirst step would be for the end user to enter a search string and selecta display hierarchy. In functional block 54′, the next step would be forthe search module to search through the database records contained on ordownloaded from the CD ROM to match the search string with thenon-common strings contained in the searchable database records. Asshown in functional block 56′ the next step would be for the searchmodule to order the search results by applying information in thecategorical tags of the matching finite elements (which are containedin, or are downloaded from the CD ROM) and/or by applying the weight ofthe matching strings to the selected display hierarchy as discussedabove. As shown in functional block 58′ the next step is to display thesearch results in preferably a collapsible/expandable hierarchy. Asshown in functional block 60′, the end user, upon viewing the searchresults will determine whether or not the results are satisfactory. Ifnot satisfactory, the process will return to functional block 52′ wherethe end user will input a new search string and/or will select a newdisplay hierarchy. If the display results of step 58′ are satisfactory,the process will advance to functional block 64′ where the end user willselect one of the finite elements from the search results display.Advancing to functional block 66′ the un-break module will reconstructthe portion of the information resource that includes the selectedfinite element by accessing the selected finite element and the othersurrounding or related finite elements from the CD ROM to create thecontiguous portion of the informational resource that included thefinite element.

In another embodiment of the present invention the informationmanagement, retrieval and display system may be specifically configuredto search through a number of individual Web pages resident on theInternet and to display the results of the search in ancollapsible/expandable format based upon a user selected displaycriteria or hierarchy. In such an embodiment, a break module in the formdescribed above may not be necessary because each Web page may alreadybe considered a “finite element” and the search engines will not be ableto modify the Web pages. Therefore, with such an embodiment, the searchengine will also not be able to insert the categorical into the finiteelements. Therefore, in this embodiment, the categorical tags may beeither stored separately from the finite elements or incorporateddirectly into the database records. Furthermore, it is envisioned thatthe Web page creators may desire to create their own categorical tagsfor their Web pages rather than having the search engine create one forthem. With this feature, the Web page designer may be able to influencethe search results, perhaps to achieve a more accurate description ofhis or her Web site. Of course, in such a feature may also be used bythe Web designers in a deceptive manner, where the categorical tag willcause the Web page to be listed in search results when the searcher islooking for an entirely different type of information. Recognizing thispotential problem, the index module may include an option where it willcompare the actual contents of the Web page against the embeddedcategorical tags inserted by the Web page designer, and may create a newcategorical tag to be inserted in the database record for the Web pageif there is a significant difference between the two. Likewise, thesearch engine can be configured to include an optional filter that willfilter out Web sites having unsavory contents as indicated by theembedded categorical tags or as determined upon a review of the contentof the Web page itself.

As shown in FIG. 4, in such an embodiment of the invention, theinformation management, retrieval and display system includes twoprimary modules, an index module 70 and a search module 72. Each ofthese processing modules are preferably expert engines operating upon aset of expert rules that define the operation of the individual module.The index module 70 will periodically crawl through the volume of Webpages 74 utilizing a conventional Web crawling or Web searchingtechnology such as a spider technology, which is adapted to examine eachWeb page (or as many as possible) provided on the Internet. As shown inFIG. 4, several of the Web pages may include a predefined, embeddedcategorical tag 76 included therewith. As discussed above, such anembedded tag 76 would be inserted in the Web page by the Web pagedesigner so that the search engine of FIG. 4 would utilize thispredefined embedded categorical tag rather than creating one on its own.An example of a rule from the expert rule set for defining thecategorical tag in this embodiment would be to identify the mostprominent word or phrase on the initial screen appearing when the Website is accessed.

The index module 70 will also create a searchable database 78 includinga database record 80a-80z for each of the Web pages accessed above. Thissearchable database 78 is a type of reverse index or each record 80a-80zincludes a link to a corresponding Web page, all words contained withinthe Web page (preferably excluding common words) along with theirfrequency of appearance within the Web page, and a categorical tagcreated by the index module or a copy of the categorical tag that wasincluded in the particular Web page as described above. It is envisionedthat the index module would constantly be re-accessing the Web pages 74and updating the searchable database 78, since the contents of Web pagesare also constantly being updated or changed.

When a user wishes to conduct a search using the search engine, the userwill enter a search query 82 and select an optional hierarchicalselection 84. The search query may be any conventional search query asavailable to those or ordinary skill in the art, it may include a searchword or phrases and/or operators tying the words together. The hierarchyselection informs the search module the type of display format that theuser wishes to see the results displayed within. Specifically, thehierarchy selection will inform the search module whether or not thesearch results are to be displayed in an order or structure basedentirely upon the information contained within the categorical tags(research-centric), if the search results are to be displayed in anorder depending entirely on the frequency of the key words or phrasespresent within the finite elements (conventional), or if the searchresults are to be displayed in an order or structure based upon acombination of the two (document-centric).

The search module 72 utilizing a search query 82 to search through thedatabase records, 80a-80z so as to find the database records 86 matchingthe words or phrases in the search query. The search module will then,depending upon the selected hierarchy 84, display the search results 88in an order or in a collapsible/expandable tree structure based uponinformation from the categorical tags 89 included within the databaserecords 87 matching the search query. From the display 88, the user willmake a selection 90 of a link to a Web page that he or she wishes toview and the search module will then display the Web page 92 on thedisplay screen.

FIGS. 5A and 5B provides a flow chart representation of an operation ofthe embodiment described above in FIG. 4. As illustrated in the functionblock 94, a first step is to access a Web page on the Internet. Infunctional block 96, the next step is to determine whether the accessWeb pages includes an embedded categorical tag. If the Web page includesan embedded categorical tag the process would advance to functionalblock 98 where the process will determine whether the embeddedcategorical tag is consistent with the content of the Web page. If theWeb page does not include an embedded categorical tag or if thecategorical tag is not consistent with the content of the Web page, theprocess will advance to functional block 100 where a categorical tagwill be created for the Web page. If the embedded categorical tag isconsistent with the content of the Web page in step 98 or if thecategorical tag is created for the Web page in step 100, the processwill advance to functional block 102 where a searchable database recordwill be generated for the Web page. This searchable database record willinclude the non-common words or phrases contained within the Web pageand their frequency (i.e., weight) a link to the Web page and thecategorical tag embedded within the Web page or created in step 100above. The process will then advance to functional block 104 todetermine whether a next Web page is to be accessed. If so, the processwill return to functional block 94. If the searchable database iscomplete, the process will advance to functional block 106 where a userwill enter a search word or phase in selected display hierarchy.

Advancing the functional block 108, the search engine will searchthrough database records for matches between the search word or phraseand the non-common word or phrases contained within the databaserecords. Advancing to functional block 110 the search engine will thenorder the results of the search by applying the information in thecategorical tags matching database records to the selected displayhierarchy and/or by applying the weight of the search word or phrase ineach of the matching database records to the selected display hierarchy.Advancing to functional block 112, the next step would involvedisplaying the search results on the display screen. In functional block114, if the search results are satisfactory, the user will select a Webpage link on the display screen and the search engine will display theassociated Web page selected. If the search results are unsatisfactory,the process will advance to functional block 118 where the user willenter a new search word or phrase and/or select a new display hierarchyand the process will return to functional block 108 so that anothersearch can be performed.

In the present embodiment, the expert rule sets for creating thecategorical tags, and the database records may be defined by an expertutilizing an iterative variation of the above process on a limitedportion of the Internet (similar to that as described in FIGS. 2A and 2Babove). Once the rule sets have been refined, the rule sets can beapplied to the entire Internet. The above described search engine can beoperating on a Web site or may be contained in a memory device such as aCD ROM which can be downloaded onto a computer having access to theInternet.

TABLE 1 1) $line =˜ m/<FONT FACE=\“Helvefica, Arial\”SIZE=\d >((\d)\.(\d\d|\d)?\.?(\d\d|\d)?\.?(\d\d|\d)?)*[a-zA-a\-\ \s]+)/2) $line =˜ m/<P ALIGN=\“CENTER\”>(([IXVLDCM]+)\−([^<]+?))<\P>/ 3) $line=˜ m/<PALIGN=\“CENTER\”>(Extract(s)?\s+from\s+Report\s+of\s+([IXVLDCM]+)(th|st)\s+ATCM[^<]*)\i4) Simple variable substitution^(aa)/àà A Hashtable is generated usingthe code:################################################################################################# SUB: gen_hashes # # Purpose: To generate a tables based on a setpattern from an # files related to the Antarctic Treaty Project.################################################################################################sub gen_hashes { my $FileList = @_[0]; print “FileList:$FileList<br>\n”; print “Generating Year-Roman Numeral and Year-MajorDocument Name Hashes.\n\n”; print “Processing”; while ($InputFN =glob(“$FileList”)) { open (InFile, “<SInputFN”)∥die(“Cannot open$InputFN\n$!”); print “.”; while (defined($line = <InFile>)) {chomp($line); # Remove unwanted characters from the line $line =rem_all($line); # print $line; # Begin Matching # Attempt to grab thelast for digits of a line, if they are on the line if ($line =˜m/^*\w+\w+\w+\w+|\w+\w+\w+), ?(\w+|\w+\w+|\w+\w+),? ?(\d|v\d\d)(\w+)?−(\d|\d\d)(\w+)?\w+(\d\d\d\d)/) { # Debugging Code #print “$1 $2 $3$4 $5 $6 $7 $8 $9 $10\n”; $MajorDoc = $1; $year = $7; if (“$year”ne “ ”){ if (defined($NextLine = <InFile>)) { # Remove unwanted characters fromthe line $NextLine = rem_all($NextLine); # Match the Roman Numerals atthe beginning of the # next line if($NextLine =˜ m/^([IVXLCDM]+)\) {$RomanNumeral = $1; $YearTrans{$RomanNumeral} = $year; $DocTrans{$year}= $MajorDoc; } } } } } close InFile; } print “\n”; }

APPENDIX A

Then, when the Dewey tag is written out, the ATCM is placed in theappropriate position, whether it be the first, second, or third levelusing the Year from the currently matched pattern to obtain the correctATCM from the hashtable (DocTrans table specifically) as generatedabove. 5) Simple variable substitutionaaa A Hashtable is generated usingthe code:

The following Appendix provides example code segments for dividing theAntarctic Treaty into a plurality of finite elements and for creatingcategorical tags for the finite elements.

############################################################ # SUB:gen_hashes # # Purpose: To generate a tables based on a set pattern froman # files related to the Antarctic Treaty Project.############################################################ sub gen₁₃hashes { my $FileList = @_[0]; print “FileList: $FileList<br>\n”; print“Generating Year-Roman Numeral and Year-Major Document NameHashes.\n\n”; print “Processing”; while ($InputFN = glob(“$FileList”)) {open (InFile, “<$InputFN”)∥die(“Cannot open $InputFN\n$!”); print “.”;while (defined($line = <InFile>)) { chomp($line); # Remove unwantedcharacters from the line $line = rem_all($line); # print $line; # BeginMatching # Attempt to grab the last for digits of a line, if they are onthe line if ($line =˜ m/^*\w+\w+\w+\w+|\w+\w+\w+),?(\w+|\w+\w+|\w+\w+),? ?(\d|v\d\d)( \w+)?−(\d|\d\d)(\w+)?\w+(\d\d\d\d)/){ # Debugging Code #print “$1 $2 $3 $4 $5 $6 $7 $8 $9 $10\n”; $MajorDoc= $1; $year = $7; if (“$year”ne “ ”) { if (defined($NextLine =<InFile>)) { # Remove unwanted characters from the line $NextLine =rem_all($NextLine); # Match the Roman Numerals at the beginning of the #next line if($NextLine =˜ m/^([IVXLCDM]+)\) { $RomanNumeral = $1;$YearTrans{$RomanNumeral} = $year; $DocTrans{$year} = $MajorDoc; } } } }} close InFile; } print “\n”; }

Then, when the Dewey tag is written out, the Year is placed in theappropriate position, whether it be the first, second, or third levelusing the Roman Numeral from the currently matched pattern to obtain thecorrect Year from the hashtable (YearTrans table specifically) asgenerated above.

TABLE 2 1) <meta name=“Dewey” content=“Seventeenth AntarcticConsultative Meeting%%====%%%%====%%%%====%%%%====%% Article XII”> 2)<meta name=“Dewey” content=“CONSERVATION OF ANTARCTIC MARINE LIVINGRESOURCES%%====%%Convention on the Conservation ofAntarctic%%====%%%%====%%%%====%% 1981 Article VI Relationship toexisting conventions relating to the conservation of whales and seals”>3)<meta name=“Dewey” content=“Resolutions and Measures adopted at theXIXth Antarctic Treaty Consultative Meeting%%====%%AnnexC%%====%%Resolutions%%====%%%%====%%Resolution 8”> 4) <meta name=“Dewey”content=“Seventeenth Antarctic ConsultativeMeeting%%====%%%%====%%%%====%%%%====%% Article XII”> 5) <metaname=“Dewey” content=“1980%%====%%Convention on the Conservation ofAntarctic%%====%%%%====%%%%====%%1980 Article

While the systems and methods described herein constitute preferredembodiments of the invention, it is to be understood that the inventionis not limited to these precise forms, and that changes may be madetherein without departing from the scope of the invention.

1. A method for generating a searchable informational resource comprising the steps of: (a) dividing an informational resource including at least one document into a plurality of finite elements, the dividing step (a) being performed by an expert system according to a first rule set; (b) assigning a categorical tag to each of the plurality of finite elements, the categorical tag including data pertaining to a content of the finite element, the assigning step (b) being performed by an expert system according to a second rule set; (c) generating a searchable database record for each of the plurality of finite elements, each searchable database record including at least one non-common string contained within the finite element and word frequency data pertaining to the frequency of the non-common words contained within the corresponding finite element; (d) supplying receiving a search string including at least one search word; (e) searching the searchable database for searchable database records containing the search string so as to provide search results; (f) arranging the results of the searching step in a hierarchal structure including a collapsible/expandable hierarchy having at least two levels according to the information in the categorical tags assigned to the finite elements corresponding to the searchable database records found in the searching step, and ordering the results of the searching step according to a first one of the levels and further ordering the results of the searching step according to a next one of the levels, wherein at least one of the levels of the hierarchal structure is ordered based upon the data included in the categorical tags assigned to the finite elements that are associated with the database records found in the searching step (e); (g) displaying the results of the searching step in the hierarchal structure; (h) modifying at least one of the first and second rule sets, responsive to viewing, by an expert having expert knowledge regarding content and structure of the informational resource, unsatisfactory results in the displaying step (g); and (i) repeating steps (a) through (h) until the expert views satisfactory results in the displaying step (g).
 2. The method of claim 1, wherein the informational resource is a single document and the step of dividing the informational resource into a plurality of finite elements includes the step of identifying a plurality of sections in the single document, wherein each finite element is a single one of the plurality of sections.
 3. The method of claim 1, wherein the informational resource is a plurality of documents and the step of dividing the informational resource into a plurality of finite elements includes the step of identifying the plurality of documents, wherein each finite element is a single one of the plurality of documents.
 4. The method of claim 1, wherein the informational resource is a plurality of documents and the step of dividing the informational resource into a plurality of finite elements includes the step of identifying the plurality of documents and identifying sections within the plurality of documents, wherein each finite element is associated with an identified section.
 5. The method of claim 4, wherein the identified section is an entire one of the plurality of documents.
 6. The method of claim 1, wherein the informational resource is a data stream and the step of dividing the informational resource into a plurality of finite elements includes the step of identifying segments within the data stream.
 7. The method of claim 1, wherein the categorical tag includes data pertaining to an organizational attribute of the finite element with respect to the informational resource.
 8. The method of claim 1, wherein the categorical tag includes data pertaining to the location of the finite element.
 9. The method of claim 1, wherein the categorical tag includes a categorical phrase pertaining to the content of the finite element.
 10. The method of claim 1, wherein the categorical tag includes a categorical number pertaining to the content of the finite element.
 11. The method of claim 10, wherein the categorical number is based upon a categorical referencing system analogous to the Dewey decimal system.
 12. The method of claim 1, wherein the step of dividing the informational resource into a plurality of finite elements includes the step of identifying and distinguishing between headings and sub-headings within the informational resource.
 13. The method of claim 1, wherein each database record further includes an address or link to the corresponding finite element.
 14. The method of claim 1, wherein the database record includes non-common strings contained within the finite element.
 15. The method of claim 14, wherein: the informational resource is at least one document; the database record includes non-common words contained within the finite element; and the step of supplying a search string involves a step of assigning at least one search word.
 16. The method of claim 15 wherein each database record further includes word frequency data pertaining to the frequency of the non-common words contained within the corresponding finite element.
 17. The method of claim 16 wherein a hierarchal structure is a collapsible/expandable hierarchy, having at least two levels and the arranging step (f) involves the step of ordering the results of the searching step according to a first one of the levels and then further ordering the results of the searching step according to a next one of the levels.
 18. The method of claim 17, wherein at least one of the levels of the hierarchal structure is ordered based upon the data included in the categorical tags assigned to the finite elements that are associated with the database records found in the searching step (e).
 19. The method of claim 18 1, wherein another one of the two levels of the hierarchal is ordered based upon the word frequency data for database records found in the searching step (e).
 20. The method of claim 1 wherein a hierarchal structure is a collapsible/expandable hierarchy, having at least two levels and the arranging step (f) involves the step of ordering the results of the searching step according to a first one of the levels and then further ordering the results of the searching step according to a next one of the levels.
 21. The method of claim 20, wherein at least one of the levels of the hierarchal structure is ordered based upon the data included in the categorical tags assigned to the finite elements that are associated with the database records found in the searching step (e).
 22. The method of claim 1, wherein: the informational resource includes a document; the step of dividing the informational resource into a plurality of finite elements includes the step of identifying a plurality of sections in the document, each finite element being a single one of the plurality of sections the categorical tag includes information pertaining to a location of the finite element with respect to other finite elements in the document; and the step of arranging the results of the searching step in a hierarchal structure according to the information in the categorical tags assigned to the finite elements corresponding to the searchable database records found in the searching step, includes the step of arranging the finite elements in an order in which the finite elements appear in the document.
 23. The method of claim 1, wherein step (b) includes the step of inserting each categorical tag into the respective one of the plurality of finite elements.
 24. The method of claim 1, wherein step (c) includes the step of inserting each categorical tag into the database record corresponding to the respective one of the finite elements.
 25. The method of claim 1, wherein the supplying receiving step (d) includes the steps of: providingreceiving an initial search string; and creating at least one additional search string having a substantially similar meaning or effect of the initial search string.
 26. The method of claim 25, wherein the initial search string is a word in a first language and the at least one additional search string is the word in a second language.
 27. The method of claim 25, wherein the initial search string is a word having a first meaning and the at least one additional search string is another word having a second meaning substantially similar to the first meaning.
 28. The method of claim 25, wherein the at least one additional search string is based upon a known permeation permutation of the initial search string.
 29. A method for retrieving information from an informational resource comprising the steps of: breaking apart the informational resource into a plurality of discrete finite elements; creating a categorical tag for each of the plurality of discrete finite elements, the categorical tag including data pertaining to a content of the discrete finite element; generating a searchable database including a searchable database record for each of the discrete finite elements; searching the searchable database for relevant database records; associating the relevant database records with corresponding relevant, discrete finite elements; selecting a hierarchy for displaying identifying phrases pertaining to the relevant, discrete finite elements; ordering the relevant, discrete finite elements in the hierarchy according, at least in part, to the categorical tag created for each of the discrete finite elements; displaying the identifying phrases pertaining to the relevant, discrete finite elements according to the results of the ordering step; selectingreceiving a selection of one of the identifying phrases; accessing the discrete finite element corresponding to the selected identifying phrase; and constructing a new informational resource for viewing using the accessed, relevant discrete finite element and other related, discrete finite elements including discrete finite elements corresponding to database records found in the searching step, and ordering the other related, discrete finite elements and the accessed, relevant discrete finite element according to information contained within the categorical tags of the other related, discrete finite elements and the accessed, relevant discrete finite element.
 30. The method of claim 29, wherein the other related, discrete finite elements are determined based upon information contained within the categorical tag of the accessed, relevant discrete finite element.
 31. The method of claim 29, wherein the other related, discrete finite elements include discrete finite elements corresponding to database records found in the searching step.
 32. The method of claim 31, wherein the step of constructing the new informational resource includes the step of ordering the other related, discrete finite elements and the accessed, relevant discrete finite element according to information contained within the categorical tags of the other related, discrete finite elements and the accessed, relevant discrete finite element.
 33. A computerized system for retrieving information from an informational resource comprising: a computer including software operating thereon that comprises: a break module, configured to break the informational resource into a plurality of finite elements and create a categorical tag for each finite element, the categorical tag including data pertaining to a content of the finite element: an index module, configured to create a searchable database having a plurality of database records, each database record corresponding to at least one of the finite elements and including at least a portion of data contained in or pertaining to the finite element; a search module, configured to compare a search query with each of the database records and determine which, if any, of the database records are relevant database records; and an unbreak module configured to associate the relevant database records with their respective finite elements; wherein said break module, index module, search module and unbreak module are each separate processing modules to provide a generally modular system; wherein an identifying phrase pertaining to one of the finite elements is selected; wherein the finite element corresponding to the selected identifying phrase is accessed; wherein a new informational resource is constructed for viewing using the accessed, relevant finite element and other related finite elements determined based upon information contained within the categorical tag of the accessed, relevant finite element, wherein the other related finite elements include finite elements corresponding to the relevant database records; and wherein the accessed, relevant finite element and other related finite elements are ordered according to the information contained within the categorical tags of the other related, finite elements and the accessed, relevant finite element.
 34. A computer implemented method for retrieving information from an informational resource comprising one or more of the steps of: breaking the informational resource into a plurality of discrete finite elements and creating a categorical tag for each discrete finite element, the categorical tag including data pertaining to a content of the discrete finite element, by a break module; generating, by an index module, a searchable database including a searchable database record for each of the discrete finite elements; searching, by a search module, the searchable database for relevant database records that correspond to a search query; and associating the relevant database records with their respective discrete finite elements by an unbreak module; wherein said break module, index module, search module and unbreak module are each separate processing modules to provide a generally modular system; wherein a selection of an identifying phrase pertaining to one of the discrete finite elements is selected; wherein the discrete finite element corresponding to the selected identifying phrase is accessed; wherein a new informational resource is constructed for viewing using the accessed, relevant discrete finite element and other related discrete finite elements determined based upon information contained within the categorical tag of the accessed, relevant discrete finite element, wherein the other related discrete finite elements include discrete finite elements corresponding to the relevant database records found in the searching step; and wherein the accessed, relevant discrete finite element and other related discrete finite elements are ordered according to the information contained within the categorical tags of the other related, discrete finite elements and the accessed, relevant discrete finite element.
 35. A storage device for operating on a computer system for processing an informational resource, the storage device comprising a break module adapted to be executed by a central processing unit and configured to break the informational resource into a plurality of finite elements and to create a categorical tag for each of the finite elements, the categorical tag including data pertaining to a content of the finite element; wherein an identifying phrase pertaining to one of the finite elements is selected; wherein the finite element corresponding to the selected identifying phrase is accessed; and wherein a new informational resource is constructed for viewing in an expandable/collapsible hierarchal structure using the accessed, relevant finite element and other related finite elements; and wherein said break module is configured to be used with at least one of: an index module, configured to create a searchable database having a plurality of database records, each database record corresponding to at least one of the finite elements and including at least a portion of data contained in or pertaining to the finite element; a search module configured to compare a search query with each of the database records and determine which, if any, of the database records are relevant database record; or an unbreak module configured to associate the relevant database records with their respective finite elements, the unbreak module being further configured to receive an input selecting at least one of the displayed identifying information to thereby select an associated finite element, and configured to reconstruct a contiguous portion of the informational resource or informational resources around the finite element corresponding to the selected displayed identifying information by displaying other finite elements that are contiguous to the selected finite element.
 36. The storage device of claim 35 wherein each categorical tag includes information pertaining to at least one of: the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain; knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element; organization data pertaining to the placement of the finite element within an organizational framework of the informational resource; author data; owner data; or timing data.
 37. The storage device of claim 35 wherein each finite element has a variable characteristic taken from a group consisting of a unit size, type, shape or data boundary.
 38. The storage device of claim 35 wherein said break module breaks said information resource into a plurality of finite elements based upon at least one set of rules that are defined by an expert or artificial intelligence.
 39. The storage device of claim 38 wherein said rule set determines a characteristic of each finite element taken from a group consisting of: a unit size, type, shape or data boundary.
 40. The storage device of claim 35 wherein said break module is configured to track the position of each finite element relative to other finite elements of said informational resource.
 41. The storage device of claim 35 wherein each finite element has an associated database record which includes at least a portion of data contained in or pertaining to the finite element; selected ones of said database records are identified as relevant database records; and the system further includes an unbreak module configured to associate the relevant database records with their respective finite elements.
 42. A computerized system comprising: a computer for processing at least part of an informational resource or combination of informational resources which are broken down into a plurality of discrete finite elements, each discrete finite element including a categorical tag and having an associated database record which includes at least a portion of data pertaining to a content of the finite element, selected ones of said database records being identified as relevant database records, said computer including software device operating thereon that includes an unbreak module configured to associate the relevant database records with their respective discrete finite elements; wherein said unbreak module is configured to arrange the relevant database records or their respective discrete finite elements in a hierarchal structure according, at least in part, to the information in the categorical tags, and further configured to display identifying information pertaining to the respective discrete finite elements of the relevant database records and receive an input selecting at least one of the displayed identifying information; wherein an identifying phrase pertaining to one of the discrete finite elements is selected; wherein the discrete finite element corresponding to the selected identifying phrase is accessed; wherein a new informational resource is constructed by the unbreak module for viewing using the accessed, relevant discrete finite element and other related discrete finite elements; and wherein said unbreak module is configured to reconstruct a contiguous portion of the informational resource around the discrete finite element corresponding to the selected identifying information by displaying other discrete finite elements that are contiguous to the discrete finite element corresponding to the selected identifying information, and wherein the unbreak module is configured to reconstruct the portion of the informational resource by reviewing the categorical tag assigned to the discrete finite element corresponding to the selected identifying information for data corresponding to the location of the selected discrete finite element with respect to the information resource as a whole.
 43. The system of claim 42 wherein each discrete finite element includes a categorical tag, and wherein said unbreak module is configured to arrange the relevant database records or their respective discrete finite elements in a hierarchal structure according, at least in part, to the information in the categorical tags.
 44. The system of claim 43 wherein the levels and organization of levels of said hierarchal structure are determined by at least one rules that are defined by an expert or artificial intelligence.
 45. The system of claim 43 wherein said hierarchal structure is an expandable/collapsible hierarchal structure which can be collapsed or expanded by an end user.
 46. The system of claim 43 wherein said unbreak module is configured to receive a selection of a hierarchal structure and display identifying information pertaining to the relevant database records or their respective discrete finite elements in the received hierarchal structure.
 47. The system of claim 42 wherein the unbreak module is configured to construct a new document by identifying, linking or displaying at least two or more discrete finite elements that are not contiguous in an original information resource.
 48. The system of claim 42 further including a break software module operating thereon that is configured to break the informational resource or combination of informational resources into the plurality of discrete finite elements and to create a categorical tag for each of the plurality of discrete finite elements, the categorical tag including information pertaining to at least one of: the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain; knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element; organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; and timing data.
 49. A method for retrieving information from an informational resource including the steps of: breaking the informational resource into a plurality of discrete finite elements having at least one of a variable unit size, type, shape or data boundary, the breaking step being performed by an expert system according to a first rule set; creating a categorical tag for each discrete finite element, the categorical tag including data pertaining to a content of the discrete finite element, the creating step being performed by an expert system according to a second rule set; generating a searchable database including a searchable database record for each of the discrete finite elements; receiving a search query; searching the searchable database for relevant database records that correspond to the search query; displaying the results of the searching step; arranging the results of said searching step in a hierarchal structure according, at least in part, to the information in the categorical tags assigned to the discrete finite elements corresponding to the relevant database records, wherein said hierarchal structure is an expandable/collapsible hierarchal structure which can be collapsed or expanded by an end user; modifying at least one of the first and second rule sets, responsive to viewing, by an expert having expert knowledge regarding content and structure of the informational resource, unsatisfactory results in the displaying step; and repeating the foregoing steps until the expert views satisfactory results in the displaying step.
 50. The method of claim 49 wherein each categorical tag includes information pertaining to at least one of the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain; knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element; organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; or timing data.
 51. The method of claim 49 wherein the at least one unit size, type, shape or data boundary of each discrete finite element is defined prior to said breaking step by at least one set of rules that are defined by an expert or artificial intelligence.
 52. The method of claim 49 wherein the at least one unit size, type, shape or data boundary of each discrete finite element is defined by at least one set of rules that are defined by an expert or artificial intelligence.
 53. The method of claim 49 wherein each searchable database record includes a reverse index which includes information pertaining to at least one of: the location of the discrete finite element relative to other discrete finite elements or a word, number or other symbol frequency data pertaining to a frequency of certain words, numbers or other symbols contained in the corresponding discrete finite element.
 54. The method of claim 49 further comprising the step of associating the relevant database records with their respective discrete finite elements.
 55. The method of claim 49 further comprising the step of receiving a selection of a hierarchal structure and displaying identifying information pertaining to the discrete finite elements that correspond to the relevant database records, and wherein said arranging step arranges the results of said searching step in the received hierarchal structure.
 56. The method of claim 54 further including the steps of displaying identifying information pertaining to the respective discrete finite elements of the relevant database records produced during the associating step and receiving an input selecting at least one of the displayed identifying information to thereby select -at least one discrete finite element.
 57. The method of claim 56 further including the steps of reconstructing a contiguous portion of the informational resource around the selected discrete finite element by displaying other discrete finite elements that are contiguous to the selected discrete finite element.
 58. The method of claim 57 wherein the reconstructing step includes reviewing the categorical to assigned to the selected discrete finite element for data corresponding to the location of the selected discrete finite element with respect to the information resource.
 59. The method of claim 49 wherein said categorical tag includes a categorical designation pertaining to informational content contained in or pertaining to the discrete finite element, and wherein the categorical designation includes a unique identifier for each discrete finite element.
 60. The method of claim 49 wherein said breaking step includes tracking the position of each discrete finite element relative to other finite elements of said informational resource.
 61. The method of claim 49 wherein said creating step includes inserting said categorical tag into the respective one of the plurality of discrete finite elements.
 62. The method of claim 49 wherein said informational resource is at least one of a document, plurality of documents, a web page, a plurality of web pages, or a data stream.
 63. A computerized system for retrieving information from an informational resource comprising: a computer including software operating thereon that comprises: a break module, configured to break the informational resource into a plurality of finite elements having a variable characteristic that is defined prior to said breaking step by at least one set of predefined rules that are defined by an expert or artificial intelligence and to create a categorical tag for each of the finite elements, the categorical tag including data pertaining to a content of the finite element, the characteristic being taken from a group consisting of a unit size, type, shape or data boundary; an index module, configured to create a searchable database having a plurality of database records, each database record corresponding to at least one of the finite elements and including at least a portion of data contained in or pertaining to the finite element; and a search module, configured to compare a search query with each of the database records and determine which, if any, of the database records are relevant database records; wherein an identifying phrase pertaining to one of the finite elements is selected; wherein the finite element corresponding to the selected identifying phrase is accessed; wherein a new informational resource is constructed for viewing using the accessed, relevant finite element and other related finite elements determined based upon information contained within the categorical tag of the accessed, relevant finite element and include finite elements corresponding to the relevant database records; and wherein the accessed, relevant finite element and other related finite elements are ordered according to the information contained within the categorical tags of the other related, finite elements and the accessed, relevant finite element.
 64. A method for retrieving information from an informational resource including the steps of breaking the informational resource into a plurality of discrete finite elements, the breaking step being performed by an expert system according to a first rule set; creating a categorical tag for each discrete finite element, the categorical tag including data pertaining to a content of the discrete finite element, the creating step being performed by an expert system according to a second rule set; generating a searchable database including a searchable database record for each of the discrete finite elements, each database record including information pertaining to each associated discrete finite element or categorical tag such that the content of each associated discrete finite element or categorical tag are generally comprehensively searchable; receiving a search query; searching the searchable database for relevant database records that correspond to the search query; displaying the results of the searching step; displaying identifying information pertaining to the respective discrete finite elements of the relevant database records and receiving an input selecting at least one of the displayed identifying information to select at least one discrete finite element; reconstructing a contiguous portion of the informational resource around the selected discrete finite element by displaying other discrete finite elements that are contiguous to the selected discrete finite element, the reconstructing including reviewing the categorical tag assigned to the selected discrete finite element for data corresponding to the location of the selected discrete finite element with respect to the information resource; modifying at least one of the first and second rule sets, responsive to viewing, by an expert having expert knowledge regarding content and structure of the informational resource, unsatisfactory results in the displaying step; and repeating the foregoing steps until the expert views satisfactory results in the displaying step.
 65. The method of claim 64 wherein each categorical tag includes information pertaining to at least one of the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain; knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element, organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; or timing data.
 66. The method of claim 64 wherein each database record includes information pertaining to generally all informational content contained in or pertaining to the associated discrete finite element or categorical tag to provide a generally content comprehensive database.
 67. The method of claim 64 wherein said informational resource includes words, numbers, or symbols, and wherein said database record includes information pertaining to generally all the words, numbers or other symbols of said informational resource.
 68. The method of claim 64 wherein each discrete finite element includes symbolic units, and wherein said database record includes a representation of generally all of the symbolic units of each discrete finite element such that said searching step includes searching generally all of the symbolic units of each discrete finite element.
 69. The method of claim 68 wherein said symbolic units include at least one of words, numbers or other symbols.
 70. The method of claim 64 wherein each searchable database record includes a reverse index which includes information pertaining to at least one of the location of the discrete finite element relative to other discrete finite elements; word, number or other symbol frequency data pertaining to a frequency of certain words, numbers or other symbols contained in the corresponding discrete finite element; the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain, knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element; organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; or timing data.
 71. The method of claim 64 further comprising the step of associating the relevant database records with their respective discrete finite elements.
 72. The method of claim 64 further comprising the step of arranging the results of said searching step in a hierarchal structure according, at least in part, to the information in the categorical tags assigned to the finite elements corresponding to the relevant database records.
 73. The method of claim 72 wherein said hierarchal structure is an expandable/collapsible hierarchal structure which can be collapsed or expanded by an end user.
 74. The method of claim 72 further comprising the step of receiving a selection of a hierarchal structure and displaying identifying information pertaining to the discrete finite elements that correspond to the relevant database records, and wherein said arranging step arranges the results of said searching step in the received hierarchal structure.
 75. The method of claim 64 wherein said categorical tag includes a categorical designation pertaining to informational content contained in or pertaining to the discrete finite element, and wherein the categorical designation includes a unique identifier for each discrete finite element.
 76. The method of claim 64 wherein said breaking step includes tracking the position of each discrete finite element relative to other discrete finite elements of said informational resource.
 77. The method of claim 64 wherein said creating step includes inserting said categorical tag into the respective one of the plurality of discrete finite elements.
 78. The method of claim 64 wherein said informational resource is at least one of a document, plurality of documents, a web page, a plurality of web pages, or a data stream.
 79. A computerized system for retrieving information from an informational resource comprising: a computer including software operating thereon that comprises: a break module, configured to break the informational resource into a plurality of finite elements using an expert system according to a first rule set and to create a categorical tag for each of the finite elements using an expert system according to a second rule set, the categorical tag including data pertaining to a content of the finite element; an index module, configured to create a searchable database having a plurality of database records, each database record corresponding to at least one of the finite elements and including information pertaining to each associated finite element or categorical to such that the content of each associated finite element or categorical tag are generally comprehensively searchable; and a search module, configured to compare a search query with each of the database records and determine which, if any, of the database records are relevant database records, to display the results of the search, to display identifying information pertaining to the respective finite elements of the relevant database records, and receive an input selecting at least one of the displayed identifying information to thereby select at least one finite element; wherein at least one of the first and second rule sets is modified, responsive to viewing, by an expert having expert knowledge regarding content and structure of the informational resource, unsatisfactory results in the displayed results until the expert views satisfactory results in the displayed results; and wherein a contiguous portion of the informational resource around the selected finite element is constructed by displaying other finite elements that are contiguous to the selected finite element, the constructing including reviewing the categorical tag assigned to the selected finite element for data corresponding to the location of the selected finite element with respect to the information resource.
 80. The system of claim 79 wherein each finite element includes symbolic units, and wherein said database record includes a representation of generally all of the symbolic units of a finite element or categorical tag such that said search module can search generally all of the symbolic units of a finite element.
 81. A data storage device comprising: a computer including software operating thereon that comprises: an informational resource divided into a plurality of finite elements by an expert system according to a first rule set, each of the finite elements including a categorical tag and a database record assigned thereto, the categorical tag including data pertaining to a content of the finite element, the categorical tag being created by an expert system according to a second rule set, the database record including information pertaining to each associated finite element or categorical tag such that the content of each associated finite element or categorical tag are generally comprehensively searchable; and software instructions programmed to direct retrieval and display of at least a portion of the informational resource, the software instructions being configured to perform the steps of: receiving a search query; searching through the database records for relevant database records matching the search query; displaying the results of the searching step; receiving a selection of one of the results of the searching step; accessing the finite element corresponding to the selected result; and constructing a new informational resource for viewing using the accessed, relevant finite element and other related, finite elements including finite elements corresponding to results found in the searching step, and ordering the other related, finite elements and the accessed, relevant finite element according to information contained within the categorical tags of the other related, finite elements and the accessed, relevant finite element; wherein the step of constructing the new informational resource includes the step of ordering the other related, finite elements and the accessed, relevant finite element according to information contained within the categorical tags of the other related, finite elements and the accessed, relevant finite element; wherein at least one of the first and second rule sets is modified, responsive to viewing, by an expert having expert knowledge regarding content and structure of the informational resource, unsatisfactory results in the displaying step; and wherein the foregoing steps are repeated until the expert views satisfactory results in the displaying step.
 82. The device of claim 81 wherein each finite element includes symbolic units, and wherein said database record includes a representation of generally all of the symbolic units of each finite element such that said searching step includes searching generally all of the symbolic units of each finite element.
 83. A method for retrieving information from an informational resource including the steps of: breaking the informational resource into a plurality of discrete finite elements, the breaking step being performed by an expert system according to a first rule set; creating a categorical tag for each discrete finite element, the categorical tag including data pertaining to a content of the discrete finite element, the creating step being performed by an expert system according to a second rule set; generating a searchable database including a searchable database record for each of the discrete finite elements; receiving a search query; searching the searchable database for relevant database records that correspond to the search query; associating the relevant database records with their respective discrete finite elements; displaying identifying information pertaining to the relevant discrete finite elements produced during said associating step in an expandable/collapsible hierarchal structure such that the expandable/collapsible hierarchy defines relationships within or between the informational resource or informational resources from which the relevant discrete finite elements originated, or within or between relevant discrete finite elements; receiving an input selecting at least one of the displayed identifying information; reconstructing a contiguous portion of the informational resource around a discrete finite element corresponding to a selected displayed identifying information by displaying other discrete finite elements that are contiguous to the selected discrete finite element; constructing a new document including the discrete finite element corresponding to a selected displayed identifying information by combining said corresponding discrete finite element with another discrete finite element; modifying at least one of the first and second rule sets, responsive to viewing, by an expert having expert knowledge regarding content and structure of the informational resource, unsatisfactory results in the displaying step; and repeating the foregoing steps until the expert views satisfactory results in the displaying step.
 84. The method of claim 83 wherein each categorical tag includes information pertaining to at least one of the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain; knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element; organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; or timing data.
 85. The method of claim 84 wherein each discrete finite element includes at least one variable characteristic that is defined by at least one set of predefined rules prior to said breaking step; the at least one variable characteristic take from a group consisting of a unit size, type, shape or data boundary.
 86. The method of claim 83 wherein each searchable database record includes a reverse index which includes information pertaining to at least one of the location of the discrete finite element relative to other discrete finite elements; word, number or other symbol frequency data pertaining to a frequency of certain words, numbers or other symbols contained in the corresponding discrete finite element; the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain, knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discreet finite element; organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; and timing data.
 87. The method of claim 83 wherein said hierarchal structure is an expandable/collapsible hierarchal structure which can be collapsed or expanded by an end user.
 88. The method of claim 83 wherein said categorical tag includes a categorical designation pertaining to informational content contained in or pertaining to the discrete finite element, and wherein the categorical designation includes a unique identifier for each discrete finite element.
 89. The method of claim 83 wherein said breaking step includes the step of tracking the position of each discrete finite element relative to other discrete finite elements of said informational resource or a plurality of informational resources.
 90. The method of claim 83 wherein said creating step includes the step of inserting said categorical tag into the respective one of the plurality of discrete finite elements.
 91. The method of claim 83 wherein said informational resource is at least one of a document, plurality of documents, a web page, a plurality of web pages, or a data stream.
 92. A computerized system for retrieving information from an informational resource or resources comprising: a computer including software operating thereon that comprises: a break module, configured to break the informational resource into a plurality of discrete finite elements and to create a categorical tag for each of the discrete finite elements, the categorical tag including data pertaining to a content of the discrete finite element; an index module, configured to create a searchable database having a plurality of database records, each database record corresponding to at least one of the discrete finite elements and including at least a portion of data contained in or pertaining to the discrete finite element; a search module, configured to compare a search query with each of the database records and determine which, if any, of the database records are relevant database records; an unbreak module configured to associate the relevant database records with their respective discrete finite elements, wherein said system is configured to display identifying information pertaining to the relevant discrete finite elements produced by said search module in an expandable/collapsible hierarchal structure such that the expandable/collapsible hierarchy defines relationships within or between the informational resource or informational resources from which the relevant discrete finite elements originated, or within or between relevant discrete finite elements, the unbreak module being further configured to receive an input selecting at least one of the displayed identifying information to thereby select an associated discrete finite element, and configured to reconstruct a contiguous portion of the informational resource or informational resources around the discrete finite element corresponding to the selected displayed identifying information by displaying other discrete finite elements that are contiguous to the selected discrete finite element; wherein an identifying phrase pertaining to one of the discrete finite elements is selected; wherein the discrete finite element corresponding to the selected identifying phrase is accessed; and wherein a new informational resource is constructed for viewing using the accessed, relevant discrete finite element and other related discrete finite elements.
 93. The system of claim 92 wherein each categorical tag includes information pertaining to at least one of the location of the informational resource; origination of the informational resource; the location of the discrete finite element within a storage domain; knowledge space or collection or system; the location of the discrete finite element relative to other discrete finite elements of the informational resource; informational content contained in or pertaining to the discrete finite element; organization data pertaining to the placement of the discrete finite element within an organizational framework of the informational resource; author data; owner data; or timing data.
 94. The system of claim 92 wherein each discrete finite element includes at least one variable characteristic that is defined by at least one predefined set of rules prior to said breaking step; the at least one variable characteristic taken from a group consisting of a unit size, type, shape or data boundary.
 95. The system of claim 92 wherein each searchable database record includes a reverse index which includes information pertaining to at least one of the location of the discrete finite element relative to other discrete finite elements or word, number or other symbol frequency data pertaining to a frequency of certain words, numbers or other symbols contained in the corresponding discrete finite element.
 96. The system of claim 92 wherein said categorical tag includes a categorical designation pertaining to informational content contained in or pertaining to the associated discrete finite element, and wherein the categorical designation includes a unique identifier for each discrete finite element or a plurality of informational resources.
 97. The system of claim 92 wherein said unbreak module is configured to track the position of each discrete finite element relative to other discrete finite elements of said informational resource.
 98. The system of claim 92 wherein said index module inserts said categorical tag into the respective one of the plurality of discrete finite elements.
 99. The system of claim 92 wherein said informational resource is at least one of a document, plurality of documents, a web page, a plurality of web pages, or a data stream. 